The subgraph homeomorphism problem on reducible flow graphs
نویسندگان
چکیده
We investigate the subgraph homeomorphism problem in which one would like to determine whether a fixed pattern graph is hcmeomorphic to a subgraph of an input graph. We show that for every fixed pattern graph, there is a polynomial-time algorithm to solve the problem if the input graphs are restricted to reducible flow graphs.
منابع مشابه
The Existence of Homeomorphic Subgraphs in Chordal Graphs
We establish conditions for the existence, in a chordal graph, of subgraphs homeomorphic to Kn (n ≥ 3), Km,n (m,n ≥ 2), and wheels Wr (r ≥ 3). Using these results, we develop a simple linear time algorithm for testing planarity of chordal graphs. We also show how these results lead to simple polynomial time algorithms for the Fixed Subgraph Homeomorphism problem on chordal graphs for some speci...
متن کاملOn a perfect problem
We solve Open Problem (xvi) from Perfect Problems of Chvátal [1] available at ftp://dimacs.rutgers.edu/pub/perfect/problems.tex: Is there a class C of perfect graphs such that (a) C does not include all perfect graphs and (b) every perfect graph contains a vertex whose neighbors induce a subgraph that belongs to C? A class P is called locally reducible if there exists a proper subclass C of P s...
متن کاملThe Homeomorphism Problem for Countable Topological Spaces
We consider the homeomorphism problem for countable topological spaces and investigate its descriptive complexity as an equivalence relation. It is shown that even for countable metric spaces the homeomorphism problem is strictly more complicated than the isomorphism problem for countable graphs and indeed it is not Borel reducible to any orbit equivalence relation induced by a Borel action of ...
متن کاملGraphs with no 7-wheel subdivision
The subgraph homeomorphism problem, SHP(H), has been shown to be polynomial-time solvable for any fixed pattern graph H , but practical algorithms have been developed only for a few specific pattern graphs. Among these are the wheels with four, five, and six spokes. This paper examines the subgraph homeomorphism problem where the pattern graph is a wheel with seven spokes, and gives a result th...
متن کاملGraphs with no 7-wheel subdivision, version II
The subgraph homeomorphism problem, SHP(H), has been shown to be polynomial-time solvable for any fixed pattern graph H, but practical algorithms have been developed only for a few specific pattern graphs. Among these are the wheels with four, five, and six spokes. This paper examines the subgraph homeomorphism problem where the pattern graph is a wheel with seven spokes, and gives a result tha...
متن کامل